Graph Grammar Abstraction for Complex Dynamic Data Structures
نویسندگان
چکیده
Abstract. We present a new abstraction method for heap structures that is based on hyperedge replacement grammars. We use labeled hypergraphs as abstract representation of heap structures. A given hypergraph replacement grammar induces a set of concrete heap structures from a hypergraph. Our technique allows to abstract and concretize the heap partially. Thus the heap parts of high entropy can be left concrete while we abstract from those heap parts that are of a regular shape maintaining structural information.
منابع مشابه
Graph Grammar Engineering: A Software Specification Method
Graphs as conceptual data models are accepted and used in a wide range of different problem areas. Giving some examples we outline common aspects for modeling complex structures by graphs. We present a formal frame-work based on graph grammars to specify graph classes and the corresponding graph manipulations. We show that such a specification can be written in a systematic, engineering-like ma...
متن کاملFormal specification of semantics of UML 2.0 activity diagrams by usingGraph Transformation Systems
Graphical structures of various kinds (like graphs, diagrams, visual sentences) are very useful to describe complex structures and systems. The field of Graph transformation and Abstract State Machine has been widely used for modeling. Graphs are well suited to describe the underlying structures of models. They provide a good method to carry out the analysis and verification activities and use ...
متن کاملVerification of Programs Manipulating Complex Dynamic Data Structures
We develop a verification method based on a novel use of tree automata to represent heap configurations to allow verification of important properties—such as no nullpointer dereferences, absence of memory leaks, etc.—for programs manipulating complex dynamically linked data structures. In our approach, a heap is split into several “separated” parts such that each of them can be represented by a...
متن کاملVisual Hypermedia Authoring
This work proposes a visual grammar-based approach to support web designers during the analysis and the design phases of complex hypermedia structures. The hypermedia is defined through a formal visual language at two abstraction levels: the hypermedia graph outer and inner structures. The model makes it possible to verify the correctness of hypermedia structures andion levels: the hypermedia g...
متن کاملVerification of Programs with Complex Data
In this thesis, we discuss methods of model checking of infinite-state space systems based on symbolic verification—in particular, we concentrate on the use of the so-called regular tree model checking. As a part of our original contribution, we first present abstract regular tree model checking (ARTMC), a technique based on a combination of regular tree model checking with an automated abstrac...
متن کامل